Dealiased Convolutions for Pseudospectral Simulations
نویسندگان
چکیده
Efficient algorithms have recently been developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place convolutions, the memory requirements are identical with the zero-padding technique, with the important distinction that the additional work memory need not be contiguous with the input data. This decoupling of data and work arrays dramatically reduces the memory and computation time required to evaluate higher-dimensional in-place convolutions. The memory savings is achieved by computing the in-place Fourier transform of the data in blocks, rather than all at once. The technique also allows one to dealias the n-ary convolutions that arise on Fourier transforming cubic and higher powers. Implicitly dealiased convolutions can be built on top of state-of-the-art adaptive fast Fourier transform libraries like FFTW. Vectorized multidimensional implementations for the complex and centered Hermitian (pseudospectral) cases have already been implemented in the open-source software FFTW++. With the advent of this library, writing a high-performance dealiased pseudospectral code for solving nonlinear partial differential equations has now become a relatively straightforward exercise. New theoretical estimates of computational complexity and memory use are provided, including corrected timing results for 3D pruned convolutions and further consideration of higher-order convolutions.
منابع مشابه
Multithreaded Implicitly Dealiased Pseudospectral Convolutions
Convolutions are used in data and image analysis and form the crux of the pseudospectral method for direct numerical simulations of fluids. Their calculation is a computationally expensive task that is facilitated by the use of FFTs at the expense of increased memory, which is required for the removal of aliased terms. Here, we present a multithreaded version of the method of implicit dealiasin...
متن کاملEfficient Dealiased Convolutions without Padding
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place convolutions, the memory requirements are identical with the zero-padding technique, with the important distinction that the additional work memory need not be contiguous with the input data. This decoupling of data a...
متن کاملImplicitly Dealiased Convolutions: Example Applications and Performance Comparison
Implicitly dealiasing is a recently-developed technique which improves upon conventional zero padding to compute linear convolutions via fast Fourier transforms. For onedimensional inputs, the memory requirements and performance are similar to conventional zero-padded convolutions, but implicitly dealiased convolutions are faster and require less memory when the data is multi-dimensional. We sh...
متن کاملCasimir Cascades in Two-Dimensional Turbulence
In addition to conserving energy and enstrophy, the nonlinear terms of the twodimensional incompressible Navier–Stokes equation are well known to conserve the global integral of any continuously differentiable function of the scalar vorticity field. However, the phenomenological role of these additional inviscid invariants, including the issue as to whether they cascade to large or small scales...
متن کاملMultithreaded implicitly dealiased convolutions
Implicit dealiasing is a method for computing in-place linear convolutions via fast Fourier transforms that decouples work memory from input data. It offers easier memory management and, for long one-dimensional input sequences, greater efficiency than conventional zero-padding. Furthermore, for convolutions of multidimensional data, the segregation of data and work buffers can be exploited to ...
متن کامل